The monomorphism problem in free groups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The monomorphism problem in free groups

Let F be a free group of finite rank. We say that the monomorphism problem in F is decidable if there is an algorithm such that, for any two elements u and v in F , it determines whether there exists a monomorphism of F that sends u to v. In this paper we show that the monomorphism problem is decidable and we provide an effective algorithm that solves the problem. Mathematics Subject Classifica...

متن کامل

The adjunction problem over torsion-free groups.

We prove injectivity and relative asphericity for "layered" systems of equations over torsion-free groups, when the exponent matrix is invertible over Z.

متن کامل

The Conjugacy Problem in Wreath Products and Free Metabelian Groups

1. Introduction. The conjugacy problem was formulated by Dehn in 1912 for finitely presented groups [1]. The question was whether it can be effectively determined for such a group when two elements are conjugate. This general question was answered in the negative by Novikov in 1954 [6J. But it is still of interest to determine whether the problem is solvable for particular finitely presented gr...

متن کامل

Groups with Context-free Co-word Problem

The class of co-context-free groups is studied. A co-context-free group is defined as one whose coword problem (the complement of its word problem) is context-free. This class is larger than the subclass of context-free groups, being closed under the taking of finite direct products, restricted standard wreath products with context-free top groups, and passing to finitely generated subgroups an...

متن کامل

Groups with poly-context-free word problem

We consider the class of groups whose word problem is poly-contextfree; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free groups has poly-context-free word problem, and conjecture that the converse also holds. We prove our conjecture for several classes of soluble groups, includin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Archiv der Mathematik

سال: 2010

ISSN: 0003-889X,1420-8938

DOI: 10.1007/s00013-010-0118-0